package Lee_code;

public class Lee_718_2 {
    public int findLength(int[] nums1, int[] nums2) {

        int len1 = nums1.length;
        int len2 = nums2.length;
        //dp[i][j] ：以下标i - 1为结尾的A，和以下标j - 1为结尾的B，最长重复子数组长度为dp[i][j]。
        int[][] dp = new int[len1+1][len2+1];
        int max = 0;
        for (int i=1; i<=len1; i++){
            for (int j=1; j<=len2; j++){
                if (nums1[i-1]==nums2[j-1])
                    dp[i][j] = dp[i-1][j-1]+1;
                max = Math.max(max, dp[i][j]);
            }
        }
        return dp[len1][len2];
    }
}
